NP-Hardness of the Bandwidth Problem on Dense Graphs
نویسنده
چکیده
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum diierence between the numbers of adjacent vertices is minimal. The problem has a long and varied history and is known to be NP-hard Papadimitriou Pa 76]. Recently for dense graphs a constant ratio approximation algorithm for this problem has been constructed in Karpinski, Wirtgen and Ze-likovsky KWZ 97]. In this paper we prove that the bandwidth problem on the dense instances remains NP-hard.
منابع مشابه
NP - Hardness of the Bandwidth Problem
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum diierence between the numbers of adjacent vertices is minimal. The problem has a long and varied history and is known to be NP-hard Papadimitriou Pa 76]. Recently for-dense graphs a constant ratio approximation algorithm for this problem has been constructed in Karpinski, Wirtgen and Zelikovs...
متن کاملOn Finding Dense Common Subgraphs
We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices S that maximizes some aggregate measure of the density of the subgraphs induced by S in each of the given graphs. Different choices for the aggregation function give rise to variants of the problem that were studied recen...
متن کاملAn Approximation Algorithm for the Bandwidth Problem on Dense Graphs
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum di erence between two numbers of adjacent vertices is minimal The problem is known to be NP complete Pa and there are only few algorithms for rather special cases of the problem HMM Kr Sa Sm In this paper we present a randomized approximation algorithm for the bandwidth problem restricted to ...
متن کاملApproximation hardness of optimization problems in intersection graphs of d-dimensional boxes
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in Rd, is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(logd−1 n) is known. In some restricted cases, e.g., for d-boxes with bounded aspect ratio, a PTAS exists [17]. In this paper we prove APX-hardness (and hence no...
متن کاملApproximation hardness of edge dominating set problems
We provide the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs, Minimum Edge Dominating Set and Minimum Maximal Matching. We show that it is NP-hard to approximate the solution of both problems to within any constant factor smaller than 7 6 . The result extends with negligible loss to bounded degree graphs and to every...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997